Algebraic Polynomial-based Synthesis for Abstract Boolean Network Analysis
نویسندگان
چکیده
Function synthesis is the problem of automatically constructing functions that fulfil a given specification. Using templates to limit the form of those functions is a popular way of reducing the search-space while still allowing interesting functions to be found. We present an investigation of restrictions to templates over Boolean functions of polynomial shape, based on their algebraic normal form. These polynomials are then lazily created in such a way that completeness of the search is still guaranteed, while performance is improved. This method is then implemented using an SMT-solver (Z3) and illustrated on a biological problem, the goal of which is to synthesise (Boolean) gene regulatory networks that capture specifications derived from experimental measurements.
منابع مشابه
Algebraic theory for discrete models in systems biology
This dissertation develops algebraic theory for discrete models in systems biology. Many discrete model types can be translated into the framework of polynomial dynamical systems (PDS), that is, timeand state-discrete dynamical systems over a finite field where the transition function for each variable is given as a polynomial. This allows for using a range of theoretical and computational tool...
متن کاملNested Canalyzing, Unate Cascade, and Polynomial Functions.
This paper focuses on the study of certain classes of Boolean functions that have appeared in several different contexts. Nested canalyzing functions have been studied recently in the context of Boolean network models of gene regulatory networks. In the same context, polynomial functions over finite fields have been used to develop network inference methods for gene regulatory networks. Finally...
متن کاملAlgebraic Structure of Classes of Nonlinear Filters
ABSTRACT In this research paper, it is shown that the class of all Boolean rank order filters are represented using the class of all Positive Symmetric Boolean functions. Using this result, it is shown that the class of all permutation invariant filters are equivalent to the class of rank order filters. The algebraic structure of Positive Boolean symmetric functions and Positive Boolean functio...
متن کاملOn the immunity of Boolean functions against fast algebraic attacks using bivariate polynomial representation
In the last decade, algebraic and fast algebraic attacks are regarded as the most successful attacks on LFSR-based stream ciphers. Since the notion of algebraic immunity was introduced, the properties and constructions of Boolean functions with maximum algebraic immunity have been researched in a large number of papers. However, it is unclear whether these functions behave well against fast alg...
متن کاملThe Complexity of AND-Decomposition of Boolean Formulas
Decomposition of boolean functions is an important research topic having a long history and a wide range of applications in the logic circuit synthesis, (hyper)graph/game theory, and combinatorial optimization. AND-decomposition means representing a boolean function as a conjunction of two (or several) functions sharing a given subset of variables. If the shared subset is empty, the decompositi...
متن کامل